/*
 * @Date: 2021-09-08 20:08:52
 * @Author: Acckno1
 * @LastEditTime: 2021-09-08 20:13:39
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int n;

inline void solution() {
    cin >> n;
    for (int i = 1; i <= n; i ++ ) {
        string s;
        cin >> s;

        int len = s.size();
        string l, r;
        l = s.substr(0, len / 2);
        r = s.substr(len / 2);
        
        LL a = stoll(l), b = stoll(r);
        LL c = a * b;

        if (stoll(s) % (a * b) == 0)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}